Methods and apparatus of video coding using palette mode

ABSTRACT

An electronic apparatus performs a method of decoding video data. The method comprises, receiving, from bitstream, video data corresponding to a palette-mode coded block; determining a quantization parameter value from information included in a parameter set associated with the palette-mode coded block; identifying escape samples in the palette-mode coded block; in accordance with a determination that the quantization parameter value is greater than a threshold value: performing de-quantization on quantized escape samples according to a predefined formula to obtain reconstructed escape sample values; and in accordance with a determination that the quantization parameter value is less than or equal to the threshold value: setting the reconstructed escape samples to be the quantized escape sample values.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation application of PCT Application No. PCT/US2020/046321, entitled “METHODS AND APPARATUS OF VIDEO CODING USING PALETTE MODE” filed on Aug. 14, 2020, which is based upon and claims priority to U.S. Provisional Application No. 62/887,660, entitled “METHODS AND APPARATUS OF VIDEO CODING USING PALETTE MODE” filed on Aug. 15, 2019, which are incorporated by reference in their entireties for all purposes.

TECHNICAL FIELD

The present application generally relates to video data coding and compression, and in particular, to method and system of video coding using palette mode.

BACKGROUND

Digital video is supported by a variety of electronic devices, such as digital televisions, laptop or desktop computers, tablet computers, digital cameras, digital recording devices, digital media players, video gaming consoles, smart phones, video teleconferencing devices, video streaming devices, etc. The electronic devices transmit, receive, encode, decode, and/or store digital video data by implementing video compression/decompression standards as defined by MPEG-4, ITU-T H.263, ITU-T H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), High Efficiency Video Coding (HEVC), and Versatile Video Coding (VVC) standard. Video compression typically includes performing spatial (intra frame) prediction and/or temporal (inter frame) prediction to reduce or remove redundancy inherent in the video data. For block-based video coding, a video frame is partitioned into one or more slices, each slice having multiple video blocks, which may also be referred to as coding tree units (CTUs). Each CTU may contain one coding unit (CU) or recursively split into smaller CUs until the predefined minimum CU size is reached. Each CU (also named leaf CU) contains one or multiple transform units (TUs) and each CU also contains one or multiple prediction units (PUs). Each CU can be coded in either intra, inter or IBC modes. Video blocks in an intra coded (I) slice of a video frame are encoded using spatial prediction with respect to reference samples in neighboring blocks within the same video frame. Video blocks in an inter coded (P or B) slice of a video frame may use spatial prediction with respect to reference samples in neighboring blocks within the same video frame or temporal prediction with respect to reference samples in other previous and/or future reference video frames.

Spatial or temporal prediction based on a reference block that has been previously encoded, e.g., a neighboring block, results in a predictive block for a current video block to be coded. The process of finding the reference block may be accomplished by block matching algorithm. Residual data representing pixel differences between the current block to be coded and the predictive block is referred to as a residual block or prediction errors. An inter-coded block is encoded according to a motion vector that points to a reference block in a reference frame forming the predictive block, and the residual block. The process of determining the motion vector is typically referred to as motion estimation. An intra coded block is encoded according to an intra prediction mode and the residual block. For further compression, the residual block is transformed from the pixel domain to a transform domain, e.g., frequency domain, resulting in residual transform coefficients, which may then be quantized. The quantized transform coefficients, initially arranged in a two-dimensional array, may be scanned to produce a one-dimensional vector of transform coefficients, and then entropy encoded into a video bitstream to achieve even more compression.

The encoded video bitstream is then saved in a computer-readable storage medium (e.g., flash memory) to be accessed by another electronic device with digital video capability or directly transmitted to the electronic device wired or wirelessly. The electronic device then performs video decompression (which is an opposite process to the video compression described above) by, e.g., parsing the encoded video bitstream to obtain syntax elements from the bitstream and reconstructing the digital video data to its original format from the encoded video bitstream based at least in part on the syntax elements obtained from the bitstream, and renders the reconstructed digital video data on a display of the electronic device.

With digital video quality going from high definition, to 4K×2K or even 8 K×4K, the amount of vide data to be encoded/decoded grows exponentially. It is a constant challenge in terms of how the video data can be encoded/decoded more efficiently while maintaining the image quality of the decoded video data.

SUMMARY

The present application describes implementations related to video data encoding and decoding and, more particularly, to system and method of video encoding and decoding using palette mode.

According to a first aspect of the present application, a method of decoding video data includes receiving, from bitstream, video data corresponding to a palette-mode coded block; determining a quantization parameter value from information included in a parameter set associated with the palette-mode coded block; identifying quantized escape samples in the palette-mode coded block; in accordance with a determination that the quantization parameter value is greater than a threshold value: performing de-quantization on quantized escape samples according to a predefined formula to obtain reconstructed escape sample values; and in accordance with a determination that the quantization parameter value is less than or equal to the threshold value: setting the reconstructed escape samples to be the quantized escape sample values.

According to a second aspect of the present application, an electronic apparatus includes one or more processing units, memory and a plurality of programs stored in the memory. The programs, when executed by the one or more processing units, cause the electronic apparatus to perform the method of decoding video data as described above.

According to a third aspect of the present application, a non-transitory computer readable storage medium stores a plurality of programs for execution by an electronic apparatus having one or more processing units. The programs, when executed by the one or more processing units, cause the electronic apparatus to perform the method of decoding video data as described above.

BRIEF DESCRIPTION OF DRAWINGS

The accompanying drawings, which are included to provide a further understanding of the implementations and are incorporated herein and constitute a part of the specification, illustrate the described implementations and together with the description serve to explain the underlying principles. Like reference numerals refer to corresponding parts.

FIG. 1 is a block diagram illustrating an exemplary video encoding and decoding system in accordance with some implementations of the present disclosure.

FIG. 2 is a block diagram illustrating an exemplary video encoder in accordance with some implementations of the present disclosure.

FIG. 3 is a block diagram illustrating an exemplary video decoder in accordance with some implementations of the present disclosure.

FIGS. 4A through 4E are block diagrams illustrating how a frame is recursively partitioned into multiple video blocks of different sizes and shapes in accordance with some implementations of the present disclosure.

FIG. 5 is a block diagrams illustrating examples of determining and using a palette table for coding video data in accordance with some implementations of the present disclosure.

FIG. 6 is a flowchart illustrating an exemplary process by which a video decoder implements the techniques of decoding video data using a palette-based scheme in accordance with some implementations of the present disclosure.

DETAILED DESCRIPTION

Reference will now be made in detail to specific implementations, examples of which are illustrated in the accompanying drawings. In the following detailed description, numerous non-limiting specific details are set forth in order to assist in understanding the subject matter presented herein. But it will be apparent to one of ordinary skill in the art that various alternatives may be used without departing from the scope of claims and the subject matter may be practiced without these specific details. For example, it will be apparent to one of ordinary skill in the art that the subject matter presented herein can be implemented on many types of electronic devices with digital video capabilities.

FIG. 1 is a block diagram illustrating an exemplary system 10 for encoding and decoding video blocks in parallel in accordance with some implementations of the present disclosure. As shown in FIG. 1, system 10 includes a source device 12 that generates and encodes video data to be decoded at a later time by a destination device 14. Source device 12 and destination device 14 may comprise any of a wide variety of electronic devices, including desktop or laptop computers, tablet computers, smart phones, set-top boxes, digital televisions, cameras, display devices, digital media players, video gaming consoles, video streaming device, or the like. In some implementations, source device 12 and destination device 14 are equipped with wireless communication capabilities.

In some implementations, destination device 14 may receive the encoded video data to be decoded via a link 16. Link 16 may comprise any type of communication medium or device capable of moving the encoded video data from source device 12 to destination device 14. In one example, link 16 may comprise a communication medium to enable source device 12 to transmit the encoded video data directly to destination device 14 in real-time. The encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to destination device 14. The communication medium may comprise any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet. The communication medium may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from source device 12 to destination device 14.

In some other implementations, the encoded video data may be transmitted from output interface 22 to a storage device 32. Subsequently, the encoded video data in storage device 32 may be accessed by destination device 14 via input interface 28. Storage device 32 may include any of a variety of distributed or locally accessed data storage media such as a hard drive, Blu-ray discs, DVDs, CD-ROMs, flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing encoded video data. In a further example, storage device 32 may correspond to a file server or another intermediate storage device that may hold the encoded video data generated by source device 12. Destination device 14 may access the stored video data from storage device 32 via streaming or downloading. The file server may be any type of computer capable of storing encoded video data and transmitting the encoded video data to destination device 14. Exemplary file servers include a web server (e.g., for a website), an FTP server, network attached storage (NAS) devices, or a local disk drive. Destination device 14 may access the encoded video data through any standard data connection, including a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., DSL, cable modem, etc.), or a combination of both that is suitable for accessing encoded video data stored on a file server. The transmission of encoded video data from storage device 32 may be a streaming transmission, a download transmission, or a combination of both.

As shown in FIG. 1, source device 12 includes a video source 18, a video encoder 20 and an output interface 22. Video source 18 may include a source such as a video capture device, e.g., a video camera, a video archive containing previously captured video, a video feed interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources. As one example, if video source 18 is a video camera of a security surveillance system, source device 12 and destination device 14 may form camera phones or video phones. However, the implementations described in the present application may be applicable to video coding in general, and may be applied to wireless and/or wired applications.

The captured, pre-captured, or computer-generated video may be encoded by video encoder 20. The encoded video data may be transmitted directly to destination device 14 via output interface 22 of source device 12. The encoded video data may also (or alternatively) be stored onto storage device 32 for later access by destination device 14 or other devices, for decoding and/or playback. Output interface 22 may further include a modem and/or a transmitter.

Destination device 14 includes an input interface 28, a video decoder 30, and a display device 34. Input interface 28 may include a receiver and/or a modem and receive the encoded video data over link 16. The encoded video data communicated over link 16, or provided on storage device 32, may include a variety of syntax elements generated by video encoder 20 for use by video decoder 30 in decoding the video data. Such syntax elements may be included within the encoded video data transmitted on a communication medium, stored on a storage medium, or stored a file server.

In some implementations, destination device 14 may include a display device 34, which can be an integrated display device and an external display device that is configured to communicate with destination device 14. Display device 34 displays the decoded video data to a user, and may comprise any of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display device.

Video encoder 20 and video decoder 30 may operate according to proprietary or industry standards, such as VVC, HEVC, MPEG-4, Part 10, Advanced Video Coding (AVC), or extensions of such standards. It should be understood that the present application is not limited to a specific video coding/decoding standard and may be applicable to other video coding/decoding standards. It is generally contemplated that video encoder 20 of source device 12 may be configured to encode video data according to any of these current or future standards. Similarly, it is also generally contemplated that video decoder 30 of destination device 14 may be configured to decode video data according to any of these current or future standards.

Video encoder 20 and video decoder 30 each may be implemented as any of a variety of suitable encoder circuitry, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware or any combinations thereof. When implemented partially in software, an electronic device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the video coding/decoding operations disclosed in the present disclosure. Each of video encoder 20 and video decoder 30 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device.

FIG. 2 is a block diagram illustrating an exemplary video encoder 20 in accordance with some implementations described in the present application. Video encoder 20 may perform intra and inter predictive coding of video blocks within video frames. Intra predictive coding relies on spatial prediction to reduce or remove spatial redundancy in video data within a given video frame or picture. Inter predictive coding relies on temporal prediction to reduce or remove temporal redundancy in video data within adjacent video frames or pictures of a video sequence.

As shown in FIG. 2, video encoder 20 includes video data memory 40, prediction processing unit 41, decoded picture buffer (DPB) 64, summer 50, transform processing unit 52, quantization unit 54, and entropy encoding unit 56. Prediction processing unit 41 further includes motion estimation unit 42, motion compensation unit 44, partition unit 45, intra prediction processing unit 46, and intra block copy (BC) unit 48. In some implementations, video encoder 20 also includes inverse quantization unit 58, inverse transform processing unit 60, and summer 62 for video block reconstruction. A deblocking filter (not shown) may be positioned between summer 62 and DPB 64 to filter block boundaries to remove blockiness artifacts from reconstructed video. An in loop filter (not shown) may also be used in addition to the deblocking filter to filter the output of summer 62. Video encoder 20 may take the form of a fixed or programmable hardware unit or may be divided among one or more of the illustrated fixed or programmable hardware units.

Video data memory 40 may store video data to be encoded by the components of video encoder 20. The video data in video data memory 40 may be obtained, for example, from video source 18. DPB 64 is a buffer that stores reference video data for use in encoding video data by video encoder 20 (e.g., in intra or inter predictive coding modes). Video data memory 40 and DPB 64 may be formed by any of a variety of memory devices. In various examples, video data memory 40 may be on-chip with other components of video encoder 20, or off-chip relative to those components.

As shown in FIG. 2, after receiving video data, partition unit 45 within prediction processing unit 41 partitions the video data into video blocks. This partitioning may also include partitioning a video frame into slices, tiles, or other larger coding units (CUs) according to a predefined splitting structures such as quad-tree structure associated with the video data. The video frame may be divided into multiple video blocks (or sets of video blocks referred to as tiles). Prediction processing unit 41 may select one of a plurality of possible predictive coding modes, such as one of a plurality of intra predictive coding modes or one of a plurality of inter predictive coding modes, for the current video block based on error results (e.g., coding rate and the level of distortion). Prediction processing unit 41 may provide the resulting intra or inter prediction coded block to summer 50 to generate a residual block and to summer 62 to reconstruct the encoded block for use as part of a reference frame subsequently. Prediction processing unit 41 also provides syntax elements, such as motion vectors, intra-mode indicators, partition information, and other such syntax information, to entropy encoding unit 56.

In order to select an appropriate intra predictive coding mode for the current video block, intra prediction processing unit 46 within prediction processing unit 41 may perform intra predictive coding of the current video block relative to one or more neighboring blocks in the same frame as the current block to be coded to provide spatial prediction. Motion estimation unit 42 and motion compensation unit 44 within prediction processing unit 41 perform inter predictive coding of the current video block relative to one or more predictive blocks in one or more reference frames to provide temporal prediction. Video encoder 20 may perform multiple coding passes, e.g., to select an appropriate coding mode for each block of video data.

In some implementations, motion estimation unit 42 determines the inter prediction mode for a current video frame by generating a motion vector, which indicates the displacement of a prediction unit (PU) of a video block within the current video frame relative to a predictive block within a reference video frame, according to a predetermined pattern within a sequence of video frames. Motion estimation, performed by motion estimation unit 42, is the process of generating motion vectors, which estimate motion for video blocks. A motion vector, for example, may indicate the displacement of a PU of a video block within a current video frame or picture relative to a predictive block within a reference frame (or other coded unit) relative to the current block being coded within the current frame (or other coded unit). The predetermined pattern may designate video frames in the sequence as P frames or B frames. Intra BC unit 48 may determine vectors, e.g., block vectors, for intra BC coding in a manner similar to the determination of motion vectors by motion estimation unit 42 for inter prediction, or may utilize motion estimation unit 42 to determine the block vector.

A predictive block is a block of a reference frame that is deemed as closely matching the PU of the video block to be coded in terms of pixel difference, which may be determined by sum of absolute difference (SAD), sum of square difference (SSD), or other difference metrics. In some implementations, video encoder 20 may calculate values for sub-integer pixel positions of reference frames stored in DPB 64. For example, video encoder 20 may interpolate values of one-quarter pixel positions, one-eighth pixel positions, or other fractional pixel positions of the reference frame. Therefore, motion estimation unit 42 may perform a motion search relative to the full pixel positions and fractional pixel positions and output a motion vector with fractional pixel precision.

Motion estimation unit 42 calculates a motion vector for a PU of a video block in an inter prediction coded frame by comparing the position of the PU to the position of a predictive block of a reference frame selected from a first reference frame list (List 0) or a second reference frame list (List 1), each of which identifies one or more reference frames stored in DPB 64. Motion estimation unit 42 sends the calculated motion vector to motion compensation unit 44 and then to entropy encoding unit 56.

Motion compensation, performed by motion compensation unit 44, may involve fetching or generating the predictive block based on the motion vector determined by motion estimation unit 42. Upon receiving the motion vector for the PU of the current video block, motion compensation unit 44 may locate a predictive block to which the motion vector points in one of the reference frame lists, retrieve the predictive block from DPB 64, and forward the predictive block to summer 50. Summer 50 then forms a residual video block of pixel difference values by subtracting pixel values of the predictive block provided by motion compensation unit 44 from the pixel values of the current video block being coded. The pixel difference values forming the residual vide block may include luma or chroma difference components or both. Motion compensation unit 44 may also generate syntax elements associated with the video blocks of a video frame for use by video decoder 30 in decoding the video blocks of the video frame. The syntax elements may include, for example, syntax elements defining the motion vector used to identify the predictive block, any flags indicating the prediction mode, or any other syntax information described herein. Note that motion estimation unit 42 and motion compensation unit 44 may be highly integrated, but are illustrated separately for conceptual purposes.

In some implementations, intra BC unit 48 may generate vectors and fetch predictive blocks in a manner similar to that described above in connection with motion estimation unit 42 and motion compensation unit 44, but with the predictive blocks being in the same frame as the current block being coded and with the vectors being referred to as block vectors as opposed to motion vectors. In particular, intra BC unit 48 may determine an intra-prediction mode to use to encode a current block. In some examples, intra BC unit 48 may encode a current block using various intra-prediction modes, e.g., during separate encoding passes, and test their performance through rate-distortion analysis. Next, intra BC unit 48 may select, among the various tested intra-prediction modes, an appropriate intra-prediction mode to use and generate an intra-mode indicator accordingly. For example, intra BC unit 48 may calculate rate-distortion values using a rate-distortion analysis for the various tested intra-prediction modes, and select the intra-prediction mode having the best rate-distortion characteristics among the tested modes as the appropriate intra-prediction mode to use. Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original, unencoded block that was encoded to produce the encoded block, as well as a bitrate (i.e., a number of bits) used to produce the encoded block. Intra BC unit 48 may calculate ratios from the distortions and rates for the various encoded blocks to determine which intra-prediction mode exhibits the best rate-distortion value for the block.

In other examples, intra BC unit 48 may use motion estimation unit 42 and motion compensation unit 44, in whole or in part, to perform such functions for Intra BC prediction according to the implementations described herein. In either case, for Intra block copy, a predictive block may be a block that is deemed as closely matching the block to be coded, in terms of pixel difference, which may be determined by sum of absolute difference (SAD), sum of squared difference (SSD), or other difference metrics, and identification of the predictive block may include calculation of values for sub-integer pixel positions.

Whether the predictive block is from the same frame according to intra prediction, or a different frame according to inter prediction, video encoder 20 may form a residual video block by subtracting pixel values of the predictive block from the pixel values of the current video block being coded, forming pixel difference values. The pixel difference values forming the residual video block may include both luma and chroma component differences.

Intra prediction processing unit 46 may intra-predict a current video block, as an alternative to the inter-prediction performed by motion estimation unit 42 and motion compensation unit 44, or the intra block copy prediction performed by intra BC unit 48, as described above. In particular, intra prediction processing unit 46 may determine an intra prediction mode to use to encode a current block. To do so, intra prediction processing unit 46 may encode a current block using various intra prediction modes, e.g., during separate encoding passes, and intra prediction processing unit 46 (or a mode select unit, in some examples) may select an appropriate intra prediction mode to use from the tested intra prediction modes. Intra prediction processing unit 46 may provide information indicative of the selected intra-prediction mode for the block to entropy encoding unit 56. Entropy encoding unit 56 may encode the information indicating the selected intra-prediction mode in the bitstream.

After prediction processing unit 41 determines the predictive block for the current video block via either inter prediction or intra prediction, summer 50 forms a residual video block by subtracting the predictive block from the current video block. The residual video data in the residual block may be included in one or more transform units (TUs) and is provided to transform processing unit 52. Transform processing unit 52 transforms the residual video data into residual transform coefficients using a transform, such as a discrete cosine transform (DCT) or a conceptually similar transform.

Transform processing unit 52 may send the resulting transform coefficients to quantization unit 54. Quantization unit 54 quantizes the transform coefficients to further reduce bit rate. The quantization process may also reduce the bit depth associated with some or all of the coefficients. The degree of quantization may be modified by adjusting a quantization parameter. In some examples, quantization unit 54 may then perform a scan of a matrix including the quantized transform coefficients. Alternatively, entropy encoding unit 56 may perform the scan.

Following quantization, entropy encoding unit 56 entropy encodes the quantized transform coefficients into a video bitstream using, e.g., context adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or another entropy encoding methodology or technique. The encoded bitstream may then be transmitted to video decoder 30, or archived in storage device 32 for later transmission to or retrieval by video decoder 30. Entropy encoding unit 56 may also entropy encode the motion vectors and the other syntax elements for the current video frame being coded.

Inverse quantization unit 58 and inverse transform processing unit 60 apply inverse quantization and inverse transformation, respectively, to reconstruct the residual video block in the pixel domain for generating a reference block for prediction of other video blocks. As noted above, motion compensation unit 44 may generate a motion compensated predictive block from one or more reference blocks of the frames stored in DPB 64. Motion compensation unit 44 may also apply one or more interpolation filters to the predictive block to calculate sub-integer pixel values for use in motion estimation.

Summer 62 adds the reconstructed residual block to the motion compensated predictive block produced by motion compensation unit 44 to produce a reference block for storage in DPB 64. The reference block may then be used by intra BC unit 48, motion estimation unit 42 and motion compensation unit 44 as a predictive block to inter predict another video block in a subsequent video frame.

FIG. 3 is a block diagram illustrating an exemplary video decoder 30 in accordance with some implementations of the present application. Video decoder 30 includes video data memory 79, entropy decoding unit 80, prediction processing unit 81, inverse quantization unit 86, inverse transform processing unit 88, summer 90, and DPB 92. Prediction processing unit 81 further includes motion compensation unit 82, intra prediction processing unit 84, and intra BC unit 85. Video decoder 30 may perform a decoding process generally reciprocal to the encoding process described above with respect to video encoder 20 in connection with FIG. 2. For example, motion compensation unit 82 may generate prediction data based on motion vectors received from entropy decoding unit 80, while intra-prediction unit 84 may generate prediction data based on intra-prediction mode indicators received from entropy decoding unit 80.

In some examples, a unit of video decoder 30 may be tasked to perform the implementations of the present application. Also, in some examples, the implementations of the present disclosure may be divided among one or more of the units of video decoder 30. For example, intra BC unit 85 may perform the implementations of the present application, alone, or in combination with other units of video decoder 30, such as motion compensation unit 82, intra prediction processing unit 84, and entropy decoding unit 80. In some examples, video decoder 30 may not include intra BC unit 85 and the functionality of intra BC unit 85 may be performed by other components of prediction processing unit 81, such as motion compensation unit 82.

Video data memory 79 may store video data, such as an encoded video bitstream, to be decoded by the other components of video decoder 30. The video data stored in video data memory 79 may be obtained, for example, from storage device 32, from a local video source, such as a camera, via wired or wireless network communication of video data, or by accessing physical data storage media (e.g., a flash drive or hard disk). Video data memory 79 may include a coded picture buffer (CPB) that stores encoded video data from an encoded video bitstream. Decoded picture buffer (DPB) 92 of video decoder 30 stores reference video data for use in decoding video data by video decoder 30 (e.g., in intra or inter predictive coding modes). Video data memory 79 and DPB 92 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magneto-resistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. For illustrative purpose, video data memory 79 and DPB 92 are depicted as two distinct components of video decoder 30 in FIG. 3. But it will be apparent to one skilled in the art that video data memory 79 and DPB 92 may be provided by the same memory device or separate memory devices. In some examples, video data memory 79 may be on-chip with other components of video decoder 30, or off-chip relative to those components.

During the decoding process, video decoder 30 receives an encoded video bitstream that represents video blocks of an encoded video frame and associated syntax elements. Video decoder 30 may receive the syntax elements at the video frame level and/or the video block level. Entropy decoding unit 80 of video decoder 30 entropy decodes the bitstream to generate quantized coefficients, motion vectors or intra-prediction mode indicators, and other syntax elements. Entropy decoding unit 80 then forwards the motion vectors and other syntax elements to prediction processing unit 81.

When the video frame is coded as an intra predictive coded (I) frame or for intra coded predictive blocks in other types of frames, intra prediction processing unit 84 of prediction processing unit 81 may generate prediction data for a video block of the current video frame based on a signaled intra prediction mode and reference data from previously decoded blocks of the current frame.

When the video frame is coded as an inter-predictive coded (i.e., B or P) frame, motion compensation unit 82 of prediction processing unit 81 produces one or more predictive blocks for a video block of the current video frame based on the motion vectors and other syntax elements received from entropy decoding unit 80. Each of the predictive blocks may be produced from a reference frame within one of the reference frame lists. Video decoder 30 may construct the reference frame lists, List 0 and List 1, using default construction techniques based on reference frames stored in DPB 92.

In some examples, when the video block is coded according to the intra BC mode described herein, intra BC unit 85 of prediction processing unit 81 produces predictive blocks for the current video block based on block vectors and other syntax elements received from entropy decoding unit 80. The predictive blocks may be within a reconstructed region of the same picture as the current video block defined by video encoder 20.

Motion compensation unit 82 and/or intra BC unit 85 determines prediction information for a video block of the current video frame by parsing the motion vectors and other syntax elements, and then uses the prediction information to produce the predictive blocks for the current video block being decoded. For example, motion compensation unit 82 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code video blocks of the video frame, an inter prediction frame type (e.g., B or P), construction information for one or more of the reference frame lists for the frame, motion vectors for each inter predictive encoded video block of the frame, inter prediction status for each inter predictive coded video block of the frame, and other information to decode the video blocks in the current video frame.

Similarly, intra BC unit 85 may use some of the received syntax elements, e.g., a flag, to determine that the current video block was predicted using the intra BC mode, construction information of which video blocks of the frame are within the reconstructed region and should be stored in DPB 92, block vectors for each intra BC predicted video block of the frame, intra BC prediction status for each intra BC predicted video block of the frame, and other information to decode the video blocks in the current video frame.

Motion compensation unit 82 may also perform interpolation using the interpolation filters as used by video encoder 20 during encoding of the video blocks to calculate interpolated values for sub-integer pixels of reference blocks. In this case, motion compensation unit 82 may determine the interpolation filters used by video encoder 20 from the received syntax elements and use the interpolation filters to produce predictive blocks.

Inverse quantization unit 86 inverse quantizes the quantized transform coefficients provided in the bitstream and entropy decoded by entropy decoding unit 80 using the same quantization parameter calculated by video encoder 20 for each video block in the video frame to determine a degree of quantization. Inverse transform processing unit 88 applies an inverse transform, e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process, to the transform coefficients in order to reconstruct the residual blocks in the pixel domain.

After motion compensation unit 82 or intra BC unit 85 generates the predictive block for the current video block based on the vectors and other syntax elements, summer 90 reconstructs decoded video block for the current video block by summing the residual block from inverse transform processing unit 88 and a corresponding predictive block generated by motion compensation unit 82 and intra BC unit 85. An in-loop filter (not pictured) may be positioned between summer 90 and DPB 92 to further process the decoded video block. The decoded video blocks in a given frame are then stored in DPB 92, which stores reference frames used for subsequent motion compensation of next video blocks. DPB 92, or a memory device separate from DPB 92, may also store decoded video for later presentation on a display device, such as display device 34 of FIG. 1.

In a typical video coding process, a video sequence typically includes an ordered set of frames or pictures. Each frame may include three sample arrays, denoted SL, SCb, and SCr. SL is a two-dimensional array of luma samples. SCb is a two-dimensional array of Cb chroma samples. SCr is a two-dimensional array of Cr chroma samples. In other instances, a frame may be monochrome and therefore includes only one two-dimensional array of luma samples.

As shown in FIG. 4A, video encoder 20 (or more specifically partition unit 45) generates an encoded representation of a frame by first partitioning the frame into a set of coding tree units (CTUs). A video frame may include an integer number of CTUs ordered consecutively in a raster scan order from left to right and from top to bottom. Each CTU is a largest logical coding unit and the width and height of the CTU are signaled by the video encoder 20 in a sequence parameter set, such that all the CTUs in a video sequence have the same size being one of 128×128, 64×64, 32×32, and 16×16. But it should be noted that the present application is not necessarily limited to a particular size. As shown in FIG. 4B, each CTU may comprise one coding tree block (CTB) of luma samples, two corresponding coding tree blocks of chroma samples, and syntax elements used to code the samples of the coding tree blocks. The syntax elements describe properties of different types of units of a coded block of pixels and how the video sequence can be reconstructed at the video decoder 30, including inter or intra prediction, intra prediction mode, motion vectors, and other parameters. In monochrome pictures or pictures having three separate color planes, a CTU may comprise a single coding tree block and syntax elements used to code the samples of the coding tree block. A coding tree block may be an N×N block of samples.

To achieve a better performance, video encoder 20 may recursively perform tree partitioning such as binary-tree partitioning, ternary-tree partitioning, quad-tree partitioning or a combination of both on the coding tree blocks of the CTU and divide the CTU into smaller coding units (CUs). As depicted in FIG. 4C, the 64×64 CTU 400 is first divided into four smaller CU, each having a block size of 32×32. Among the four smaller CUs, CU 410 and CU 420 are each divided into four CUs of 16×16 by block size. The two 16×16 CUs 430 and 440 are each further divided into four CUs of 8×8 by block size. FIG. 4D depicts a quad-tree data structure illustrating the end result of the partition process of the CTU 400 as depicted in FIG. 4C, each leaf node of the quad-tree corresponding to one CU of a respective size ranging from 32×32 to 8×8. Like the CTU depicted in FIG. 4B, each CU may comprise a coding block (CB) of luma samples and two corresponding coding blocks of chroma samples of a frame of the same size, and syntax elements used to code the samples of the coding blocks. In monochrome pictures or pictures having three separate color planes, a CU may comprise a single coding block and syntax structures used to code the samples of the coding block. It should be noted that the quad-tree partitioning depicted in FIGS. 4C and 4D is only for illustrative purposes and one CTU can be split into CUs to adapt to varying local characteristics based on quad/ternary/binary-tree partitions. In the multi-type tree structure, one CTU is partitioned by a quad-tree structure and each quad-tree leaf CU can be further partitioned by a binary and ternary tree structure. As shown in FIG. 4E, there are five partitioning types, i.e., quaternary partitioning, horizontal binary partitioning, vertical binary partitioning, horizontal ternary partitioning, and vertical ternary partitioning.

In some implementations, video encoder 20 may further partition a coding block of a CU into one or more MxN prediction blocks (PB). A prediction block is a rectangular (square or non-square) block of samples on which the same prediction, inter or intra, is applied. A prediction unit (PU) of a CU may comprise a prediction block of luma samples, two corresponding prediction blocks of chroma samples, and syntax elements used to predict the prediction blocks. In monochrome pictures or pictures having three separate color planes, a PU may comprise a single prediction block and syntax structures used to predict the prediction block. Video encoder 20 may generate predictive luma, Cb, and Cr blocks for luma, Cb, and Cr prediction blocks of each PU of the CU.

Video encoder 20 may use intra prediction or inter prediction to generate the predictive blocks for a PU. If video encoder 20 uses intra prediction to generate the predictive blocks of a PU, video encoder 20 may generate the predictive blocks of the PU based on decoded samples of the frame associated with the PU. If video encoder 20 uses inter prediction to generate the predictive blocks of a PU, video encoder 20 may generate the predictive blocks of the PU based on decoded samples of one or more frames other than the frame associated with the PU.

After video encoder 20 generates predictive luma, Cb, and Cr blocks for one or more PUs of a CU, video encoder 20 may generate a luma residual block for the CU by subtracting the CU's predictive luma blocks from its original luma coding block such that each sample in the CU's luma residual block indicates a difference between a luma sample in one of the CU's predictive luma blocks and a corresponding sample in the CU's original luma coding block. Similarly, video encoder 20 may generate a Cb residual block and a Cr residual block for the CU, respectively, such that each sample in the CU's Cb residual block indicates a difference between a Cb sample in one of the CU's predictive Cb blocks and a corresponding sample in the CU's original Cb coding block and each sample in the CU's Cr residual block may indicate a difference between a Cr sample in one of the CU's predictive Cr blocks and a corresponding sample in the CU's original Cr coding block.

Furthermore, as illustrated in FIG. 4C, video encoder 20 may use quad-tree partitioning to decompose the luma, Cb, and Cr residual blocks of a CU into one or more luma, Cb, and Cr transform blocks. A transform block is a rectangular (square or non-square) block of samples on which the same transform is applied. A transform unit (TU) of a CU may comprise a transform block of luma samples, two corresponding transform blocks of chroma samples, and syntax elements used to transform the transform block samples. Thus, each TU of a CU may be associated with a luma transform block, a Cb transform block, and a Cr transform block. In some examples, the luma transform block associated with the TU may be a sub-block of the CU's luma residual block. The Cb transform block may be a sub-block of the CU's Cb residual block. The Cr transform block may be a sub-block of the CU's Cr residual block. In monochrome pictures or pictures having three separate color planes, a TU may comprise a single transform block and syntax structures used to transform the samples of the transform block.

Video encoder 20 may apply one or more transforms to a luma transform block of a TU to generate a luma coefficient block for the TU. A coefficient block may be a two-dimensional array of transform coefficients. A transform coefficient may be a scalar quantity. Video encoder 20 may apply one or more transforms to a Cb transform block of a TU to generate a Cb coefficient block for the TU. Video encoder 20 may apply one or more transforms to a Cr transform block of a TU to generate a Cr coefficient block for the TU.

After generating a coefficient block (e.g., a luma coefficient block, a Cb coefficient block or a Cr coefficient block), video encoder 20 may quantize the coefficient block. Quantization generally refers to a process in which transform coefficients are quantized to possibly reduce the amount of data used to represent the transform coefficients, providing further compression. After video encoder 20 quantizes a coefficient block, video encoder 20 may entropy encode syntax elements indicating the quantized transform coefficients. For example, video encoder 20 may perform Context-Adaptive Binary Arithmetic Coding (CABAC) on the syntax elements indicating the quantized transform coefficients. Finally, video encoder 20 may output a bitstream that includes a sequence of bits that forms a representation of coded frames and associated data, which is either saved in storage device 32 or transmitted to destination device 14.

After receiving a bitstream generated by video encoder 20, video decoder 30 may parse the bitstream to obtain syntax elements from the bitstream. Video decoder 30 may reconstruct the frames of the video data based at least in part on the syntax elements obtained from the bitstream. The process of reconstructing the video data is generally reciprocal to the encoding process performed by video encoder 20. For example, video decoder 30 may perform inverse transforms on the coefficient blocks associated with TUs of a current CU to reconstruct residual blocks associated with the TUs of the current CU. Video decoder 30 also reconstructs the coding blocks of the current CU by adding the samples of the predictive blocks for PUs of the current CU to corresponding samples of the transform blocks of the TUs of the current CU. After reconstructing the coding blocks for each CU of a frame, video decoder 30 may reconstruct the frame.

As noted above, video coding achieves video compression using primarily two modes, i.e., intra-frame prediction (or intra-prediction) and inter-frame prediction (or inter-prediction). Palette-based coding is another coding scheme that has been adopted by many video coding standards. In palette-based coding, which may be particularly suitable for screen-generated content coding, a video coder (e.g., video encoder 20 or video decoder 30) forms a palette table of colors representing the video data of a given block. The palette table includes the most dominant (e.g., frequently used) pixel values in the given block. Pixel values that are not frequently represented in the video data of the given block are either not included in the palette table or included in the palette table as escape colors.

Each entry in the palette table includes an index for a corresponding pixel value that in the palette table. The palette indices for samples in the block may be coded to indicate which entry from the palette table is to be used to predict or reconstruct which sample. This palette mode starts with the process of generating a palette predictor for a first block of a picture, slice, tile, or other such grouping of video blocks. As will be explained below, the palette predictor for subsequent video blocks is typically generated by updating a previously used palette predictor. For illustrative purpose, it is assumed that the palette predictor is defined at a picture level. In other words, a picture may include multiple coding blocks, each having its own palette table, but there is one palette predictor for the entire picture.

To reduce the bits needed for signaling palette entries in the video bitstream, a video decoder may utilize a palette predictor for determining new palette entries in the palette table used for reconstructing a video block. For example, the palette predictor may include palette entries from a previously used palette table or even be initialized with a most recently used palette table by including all entries of the most recently used palette table. In some implementations, the palette predictor may include fewer than all the entries from the most recently used palette table and then incorporate some entries from other previously used palette tables. The palette predictor may have the same size as the palette tables used for coding different blocks or may be larger or smaller than the palette tables used for coding different blocks. In one example, the palette predictor is implemented as a first-in-first-out (FIFO) table including 64 palette entries.

To generate a palette table for a block of video data from the palette predictor, a video decoder may receive, from the encoded video bitstream, a one-bit flag for each entry of the palette predictor. The one-bit flag may have a first value (e.g., a binary one) indicating that the associated entry of the palette predictor is to be included in the palette table or a second value (e.g., a binary zero) indicating that the associated entry of the palette predictor is not to be included in the palette table. If the size of palette predictor is larger than the palette table used for a block of video data, then the video decoder may stop receiving more flags once a maximum size for the palette table is reached.

In some implementations, some entries in a palette table may be directly signaled in the encoded video bitstream instead of being determined using the palette predictor. For such entries, the video decoder may receive, from the encoded video bitstream, three separate m-bit values indicating the pixel values for the luma and two chroma components associated with the entry, where m represents the bit depth of the video data. Compared with the multiple m-bit values needed for directly signaled palette entries, those palette entries derived from the palette predictor only require a one-bit flag. Therefore, signaling some or all palette entries using the palette predictor can significantly reduce the number of bits needed to signal the entries of a new palette table, thereby improving the overall coding efficiency of palette mode coding.

In many instances, the palette predictor for one block is determined based on the palette table used to code one or more previously coded blocks. But when coding the first coding tree unit in a picture, a slice or a tile, the palette table of a previously coded block may not be available. Therefore a palette predictor cannot be generated using entries of the previously used palette tables. In such case, a sequence of palette predictor initializers may be signaled in a sequence parameter set (SPS) and/or a picture parameter set (PPS), which are values used to generate a palette predictor when a previously used palette table is not available. An SPS generally refers to a syntax structure of syntax elements that apply to a series of consecutive coded video pictures called a coded video sequence (CVS) as determined by the content of a syntax element found in the PPS referred to by a syntax element found in each slice segment header. A PPS generally refers to a syntax structure of syntax elements that apply to one or more individual pictures within a CVS as determined by a syntax element found in each slice segment header. Thus, an SPS is generally considered to be a higher level syntax structure than a PPS, meaning the syntax elements included in the SPS generally change less frequently and apply to a larger portion of video data compared to the syntax elements included in the PPS.

FIG. 5 is a block diagram illustrating an example of determining and using a palette table for coding video data in a picture 500 in accordance with some implementations of the present disclosure. The picture 500 includes a first block 510 that is associated with a first palette table 520 and a second block 530 that is associated with a second palette table 540. Because the second block 530 is on the right side of the first block 510, the second palette tables 540 may be determined based on first palette tables 520. A palette predictor 550 is associated with the picture 500 and used for collecting zero or more palette entries from the first palette table 520 and constructing zero or more palette entries in the second palette table 540. Note that the various blocks depicted in FIG. 5 may correspond to CTUs, CUs, PUs, or TUs as described above and the blocks are not limited to the block structure of any particular coding standard and may be compatible with future block-based coding standards.

In general, a palette table includes a number of pixel values that are dominant and/or representative for a block currently being coded (e.g., block 510 or 530 in FIG. 5). In some examples, a video coder (e.g., video encoder 20 or video decoder 30) may code palette tables separately for each color component of a block. For example, video encoder 20 may encode a palette table for a luma component of a block, another palette table for a chroma Cb component of the block, and yet another palette table for the chroma Cr component of the block. In this case, the first palette table 520 and the second palette table 540 each may become multiple palette tables. In other examples, video encoder 20 may encode a single palette table for all color components of a block. In this case, an i-th entry in the palette table is a triple value of (Yi, Cbi, Cri), where each value corresponds to one component of a pixel. Accordingly, the representation of the first palette table 520 and the second palette table 540 is merely one example and not intended to be limiting.

As described herein, rather than directly coding the actual pixel values of the first block 510, a video coder (such as video encoder 20 or video decoder 30) may use a palette-based coding scheme to code the pixels of the first block 510 using the indices I1, . . . , IN. For example, for each pixel in the first block 510, video encoder 20 may encode an index value for the pixel, where the index value is associated with a pixel value in the first palette table 520. Video encoder 20 may encode the first palette table 520 and transmit it in an encoded video data bitstream for use by video decoder 30 for palette-based decoding at the decoder side. In general, one or more palette tables may be transmitted for each block or may be shared among different blocks. Video decoder 30 may obtain the index values from a video bitstream generated by video encoder 20 and reconstruct the pixel values using the index values' corresponding pixel values in the first palette table 520. In other words, for each respective index value for a block, video decoder 30 may determine an entry in the first palette table 520. Video decoder 30 then replaces the respective index value in the block with the pixel value specified by the determined entry in the first palette table 520.

In some implementations, a video coder (e.g., video encoder 20 or video decoder 30) determines the second palette table 540 based, at least in part, on the palette predictor 550 associated with the picture 500. The palette predictor 550 may include some or all of the entries of the first palette table 520 and possibly include entries from other palette tables as well. In some examples, the palette predictor 550 is implemented using a first-in-first-out table, where upon adding the entries of the first palette table 520 to the palette predictor 550, the oldest entries currently in the palette predictor 550 are expunged to keep the palette predictor 550 at or below a maximum size. In other examples, the palette predictor 550 may be updated and/or maintained using different techniques.

In one example, video encoder 20 may encode a pred_palette_flag for each block (e.g., second block 530) to indicate whether the palette table for the block is predicted from one or more palette tables associated with one or more other blocks, such as the neighboring block 510. For example, when the value of such a flag is a binary one, video decoder 30 may determine that the second palette table 540 for the second block 530 are predicted from one or more previously decoded palette tables and therefore no new palette table for the second block 540 is included in the video bitstream containing the pred_palette_flag. When such a flag is a binary zero, video decoder 30 may determine that the second palette table 540 for the second block 530 is included in the video bitstream as a new palette table. In some examples, pred_palette_flag may be separately coded for each different color component of a block (e.g., three flags, one for Y, one for Cb, and one for Cr, for a video block in the YCbCr space). In other examples, a single pred_palette_flag may be coded for all color components of a block.

In the example above, the pred_palette_flag is signaled per-block to indicate that every entry of the palette table for the current block is predicted. This means that the second palette table 540 is identical to the first palette table 520 and no additional information is signaled. In other examples, one or more syntax elements may be signaled on a per-entry basis. That is a flag may be signaled for each entry of a previous palette table to indicate whether that entry is present in the current palette table. If a palette entry is not predicted, the palette entry may be explicitly signaled. In other examples, these two methods could be combined.

When predicting the second palette table 540 according to the first palette table 520, video encoder 20 and/or video decoder 30 may locate a block from which the predictive palette table is determined. The predictive palette table may be associated with one or more neighboring blocks of the block currently being coded, i.e., the second block 530. As depicted in FIG. 5, video encoder 20 and/or video decoder 30 may locate a left neighboring block, i.e., the first block 510, when determining a predictive palette table for the second block 530. In other examples, video encoder 20 and/or video decoder 30 may locate one or more blocks in other positions relative to the second block 530, such as an upper block in the picture 500. In another example, the palette table for the last block in the scan order that used the palette mode may be used as a predictive palette table for the second block 530.

Video encoder 20 and/or video decoder 30 may determine a block for palette prediction according to a predetermined order of block locations. For example, video encoder 20 and/or video decoder 30 may initially identify the left neighboring block, i.e., the first block 510, for palette prediction. If the left neighboring block is not available for prediction (e.g., the left neighboring block is coded with a mode other than a palette-based coding mode, such as an intra-prediction mode or inter-prediction mode, or is located at the left-most edge of a picture or slice) video encoder 20 and/or video decoder 30 may identify the upper neighboring block in the picture 500. Video encoder 20 and/or video decoder 30 may continue searching for an available block according to the predetermined order of block locations until locating a block having a palette table available for palette prediction. In some examples, video encoder 20 and/or video decoder 30 may determine a predictive palette based on multiple blocks and/or reconstructed samples of a neighboring block by applying one or more formulas, functions, rules or the like to generate a predictive palette table based on palette tables of one or a combination of a plurality of neighboring blocks (spatially or in scan order). In one example, a predictive palette table that includes palette entries from one or more previously coded neighboring blocks includes a number of entries, N. In this case, video encoder 20 first transmits a binary vector, V, having the same size as the predictive palette table, i.e., size N, to video decoder 30. Each entry in the binary vector indicates whether the corresponding entry in the predictive palette table will be reused or copied to the palette table for the current block. For example, V(i)=1 means that the i-th entry in the predictive palette table for the neighboring block will be reused or copied to the palette table for the current block, which may have a different index in the current block.

In still other examples, video encoder 20 and/or video decoder 30 may construct a candidate list including a number of potential candidates for palette prediction. In such examples, video encoder 20 may encode an index to the candidate list to indicate the candidate block in the list from which the current block used for palette prediction is selected. Video decoder 30 may construct the candidate list in the same manner, decode the index, and use the decoded index to select the palette of the corresponding block for use with the current block. In another example, the palette table of the indicated candidate block in the list may be used as a predictive palette table for per-entry prediction of a palette table for the current block.

In some implementations, one or more syntax elements may indicate whether palette tables, such as the second palette table 540, are predicted entirely from a predictive palette (e.g., the first palette table 520, which may be composed of entries from one or more previously coded blocks) or whether particular entries of the second palette table 540 are predicted. For example, an initial syntax element may indicate whether all of the entries in the second palette table 540 are predicted. If the initial syntax element indicates that not all of the entries are predicted (e.g., a flag having a value of binary zero), one or more additional syntax elements may indicate which entries of second palette table 540 are predicted from the predictive palette table.

In some implementations, the size of a palette table, e.g., in terms of the number of pixel values that are included in the palette table may be fixed or may be signaled using one or more syntax elements in an encoded bitstream.

In some implementations, video encoder 20 may code the pixels of a block without exactly matching the pixel values in a palette table to the actual pixel values in the corresponding block of video data. For example, video encoder 20 and video decoder 30 may merge or combine (i.e., quantize) different entries in the palette table when the pixel values of the entries are within a predetermined range of each other. In other words, if there is already an existing pixel value that is within an error margin of a new pixel value, the new pixel value is not added to the palette table while the sample in the block corresponding to the new pixel value is coded with the index of the existing pixel value. Note that this process of lossy coding has no impact on the operation of video decoder 30, which may decode pixel values in the same manner, regardless of whether a particular palette table is lossless or lossy.

In some implementations, video encoder 20 may select an entry in a palette table as a predictive pixel value for encoding a pixel value in a block. Next video encoder 20 may determine a difference between the actual pixel value and the selected entry as a residual and encode the residual. Video encoder 20 may generate a residual block including the residual values for pixels in the block predicted by entries in the palette table and then apply transformation and quantization to the residue block (as described above in connection with FIG. 2). In this manner, video encoder 20 may generate quantized residual transform coefficients. In another example, the residual block may be coded losslessly (without transform and quantization) or without transform. Video decoder 30 may inverse transform and inverse quantize the transform coefficients to reproduce the residual block and then reconstruct a pixel value using the predictive palette entry value and the residual value for the pixel value.

In some implementations, video encoder 20 may determine an error threshold, referred to as a delta value, for constructing a palette table. For example, if an actual pixel value for a position in a block produces an absolute difference between the actual pixel value and an existing pixel value entry in the palette table that is less than or equal to the delta value, video encoder 20 may send an index value to identify a corresponding index of the pixel value entry in the palette table for use in reconstructing the actual pixel value for that position. If an actual pixel value for a position in a block produces absolute difference values between the actual pixel value and the existing pixel value entries in the palette table that are greater than the delta value, video encoder 20 may send the actual pixel value and add the actual pixel value to the palette table as a new entry. To construct the palette table, video decoder 30 may use delta values signaled by the encoder, rely on a fixed or known delta value, or infer or derive a delta value.

As noted above, video encoder 20 and/or video decoder 30 may use coding modes including an intra-prediction mode, an inter-prediction mode, a lossless coding palette mode, and a lossy coding palette mode when coding video data. Video encoder 20 and video decoder 30 may code one or more syntax elements indicating whether the palette-based coding is enabled. For example, at each block, video encoder 20 may encode a syntax element indicating whether a palette-based coding mode is to be used for the block (e.g., a CU or a PU). For example, this syntax element may be signaled in an encoded video bitstream at the block level (e.g., a CU level), and then received by video decoder 30 upon decoding the encoded video bitstream.

In some implementations, the above-described syntax elements may be transmitted at a higher level than the block level. For example, video encoder 20 may signal such syntax elements at a slice level, a tile level, a PPS level, or a SPS level. In this case, a value equal to one indicates that all of the blocks at or under this level are encoded using the palette mode such that no additional mode information, e.g., palette mode or other modes, is signaled at the block level. A value equal to zero indicates that none of the blocks at or under this level are encoded using the palette mode.

In some implementations, the fact that a syntax element at the higher level enables the palette mode does not mean each block at or under this higher level has to be coded with the palette mode. Rather, another CU-level or even TU-level syntax element may still be required to indicate whether the block at the CU or TU level is coded with the palette mode and if so, a corresponding palette table is to be constructed. In some implementations, video coder (e.g., video encoder 20 and video decoder 30) chooses a threshold value (e.g., 32) in terms of the number of samples within a block for minimum block size such that no palette mode is allowed for a block whose block size below the threshold value. In this case, there is no signaling of any syntax element for such block. Note that the threshold value for the minimum block size can be explicitly signaled in the bitstream or implicitly set to be a default value complied by both video encoder 20 and video decoder 30.

The pixel value at one position of a block may be the same as (or within the delta value of) pixel values at other positions of the block. For example, it is common that neighboring pixel positions of a block have the same pixel value or may be mapped to the same index value in the palette table. Accordingly, video encoder 20 may encode one or more syntax elements indicating a number of consecutive pixels or index values in a given scan order that have the same pixel value or index value. The string of like-valued pixel or index values may be referred to herein as a “run”. For example, if two consecutive pixels or indices in a given scan order have different values, the run is equal to zero. If two consecutive pixels or indices in a given scan order have the same value but the third pixel or index in the scan order has a different value, the run is equal to one. For three consecutive indices or pixels with the same value, the run is two, and so forth. Video decoder 30 may obtain the syntax elements indicating a run from an encoded bitstream and use the data to determine the number of consecutive locations that have the same pixel or index value.

FIG. 6 is a flowchart illustrating an exemplary process 600 by which a video decoder 30 implements the techniques of decoding video data using the palette-based scheme in accordance with some implementations of the present disclosure. In particular, the video decoder 30 uses information related to quantization parameters to determine whether an escape sample (e.g., a pixel that is not represented by a palette entry in the palette table as described above in connection with FIG. 5 and that requires additional overhead in the bitstream for signaling) in a palette-mode coded block is to be decoded in a lossless manner (i.e., the reconstructed pixel value for the escape sample is the same as the original pixel value) or a lossy manner (i.e., the reconstructed pixel value for the escape sample differs from the original pixel value for quantization).

To implement the palette-based scheme, video decoder 30 receives, from bitstream, video data corresponding to a palette-mode coded block (610). For example, the palette-mode coded block includes both escape samples and non-escape samples (e.g., pixel values that are represented by the palette entries in the palette table).

Next, video decoder 30 determines a quantization parameter value from information included in a parameter set associated with the palette-mode coded block (620). For example, the quantization parameter value may be associated with one of multiple coding levels and can be obtained, e.g., from a sequence parameter set, a picture parameter set, a group header corresponding to a group of tiles, a tile header, etc.

In some embodiments, for quantization design for escape samples, the scale of quantization for escape samples, given a particular quantization parameter, is the same as in the regular quantization used for samples in other coding tools (e.g., samples under transform skip case and/or transform case), but the actual operations for escape sample quantization are defined differently from the regular quantization operations. For example, the quantization operation for escape samples involves different shift and/or offset operations from the regular quantization.

In some embodiments, the quantization process is the same for escape samples and non-escape samples. In one example, the regular quantization process is used for the quantization of escape samples under palette mode. As a result, the quantization design for escapes samples would be the same as the quantization process for samples under transform skip mode and/or transform mode. The following equations describe the corresponding quantization and de-quantization process that are applied at encoder and decoder, respectively, when using the quantization/de-quantization of transform-skip mode for coding palette escape colors.

$\begin{matrix} {{{Encoder}\text{:}\mspace{14mu}{pLevel}} = {{{pResi} \cdot 2^{tr{ansformShift}}}\frac{{encScale}\left\lbrack {{QP}\mspace{14mu}{\% 6}} \right\rbrack}{{2^{14} \cdot 2^{({Q{P/6}})}}2^{tansformShift}}}} & (1) \\ {{{Decoder}\text{:}\mspace{14mu}{pResi}^{\prime}} = {\frac{pLevel}{2^{tansformShift}} \cdot \frac{{{{decScale}\left\lbrack {{QP}\mspace{14mu}{\% 6}} \right\rbrack} \cdot 2^{({Q{P/6}})}}2^{tansformShift}}{2^{6}}}} & (2) \end{matrix}$

Where pResi and pResi′ are the original and reconstructed residual coefficients; pLevel is the quantized value; transformShift is the bit-shift that is used to compensate the dynamic range increase due to 2D transforms, which is equal to 15−bitDepth−(log 2(W)+log 2(H))/2 where W and H are the width and height of the current transform unit, bitDepth is the coding bit-depth. encScale[ ] and descale[ ] are the quantization and dequantization look-up table which are in 14-bit and 6-bit precisions and defined as

TABLE 1 QP %6 0 1 2 3 4 5 encScale[QP %6] 26214 23302 20560 18396 16384 14564 decScale[QP %6] 40 45 51 57 64 72

When the size of a transform block is not a power of 4, another look-up table is defined as

TABLE 2 QP %6 0 1 2 3 4 5 encScale[QP %6] 18396 16384 14564 13107 11651 10280 decScale[QP %6] 57 64 72 80 90 102

Next, the video decoder 30 identifies quantized escape samples in the palette-mode coded block (630). For example, the quantized escape samples may be associated with additional overhead in the bitstream to distinguish from those non-escape samples represented by the palette entries in the palette table.

Once the video decoder 30 determines the escape samples in the palette-mode coded block, the video decoder 30 then determines a particular method to decode the quantized escape sample, based on information from the quantization parameter value. In accordance with a determination that the quantization parameter value is greater than a threshold value (640) (e.g., the value of quantization parameter (QP) is greater than 4), the video decoder 30 performs de-quantization on the quantized escape samples according to a predefined formula (e.g., based on Equation 2 and Table 1 or Table 2 listed above) to obtain reconstructed escape sample values (640-1). This decoding process is typically a lossy process as the reconstructed escape sample values may differ from the original sample values due to the quantization. In accordance with a determination that the quantization parameter value is less than or equal to the threshold value (650) (e.g., the value of QP is equal to or less than 4), the video decoder 30 then sets the reconstructed escape samples to be the quantized escape sample values (650-1). In this case, the decoding process is a lossless process as the reconstructed escape sample values are the same as the original sample values. In some embodiments, the video decoder 30 performs step 640 and step 650 in parallel and while determining the quantization parameter value from information included in a parameter set associated with the palette-mode coded block (e.g., while performing the step 620).

In some embodiments, the video decoder 30 performs de-quantization on the quantized escape samples of all CUs within or below a level at which the quantization parameter value is signaled. For example, if the quantization parameter value is obtained from the picture parameter set, then all quantized escape samples of CUs within the picture are to be decoded according to the predefined formula. In other words, when the value of QP is equal to or smaller than a specific value, e.g. 4, all CUs at or below the level where the quantization parameter information is signalled may be coded in lossless palette mode; when the value of QP is larger than a specific value, e.g. 4, it means that lossless palette mode is unavailable for coding any CU at or below the level where this QP information is signalled.

In some embodiments, video decoder 30 determines the quantization parameter value by first determining a delta quantization parameter value from the information included in the parameter set associated with the palette-mode coded block, and then adding the delta quantization parameter value to a reference quantization parameter value as the quantization parameter value. Exemplary code for signaling the delta quantization parameter value for a palette mode-coded CU is illustrated below:

TABLE 3 palette_coding( x0, y0, cbWidth, cbHeight, startComp, Descrip- numComps ) { tor . . . . . . // Initial palette mode syntax  if( NumPredictedPaletteEntries < palette_max_size )   num_signalled_palette_entries ae(v)  for( cIdx = startComp; cIdx < ( startComp +  numComps); cIdx++ )   for( i = 0; i < num_signalled_palette_entries; i++ )    new_palette_entries[ cIdx ][ i ] ae(v)  if( CurrentPaletteSize[ startComp ] > 0 )   palette_escape_val_present_flag ae(v)  if( MaxPaletteIndex > 0 ) {   num_palette_indices_minus1 ae(v)   adjust = 0   for( i = 0; i <= num_palette_indices_minus1; i++ ) {    if( MaxPaletteIndex − adjust > 0 ) {     palette_idx_idc ae(v)     PaletteIndexIdc[ i ] = palette_idx_idc    }    adjust = 1   }   copy_above_indices_for_final_run_flag ae(v)   palette_transpose_flag ae(v)  }  if(palette_escape_val_present_flag ) {   if( cu_qp_delta_enabled_flag &&   !IsCuQpDeltaCoded ) {    cu_qp_delta_abs ae(v)    if( cu_qp_delta_abs )     cu_qp_delta_sign_flag ae(v)   }  } . . . . . . // Other palette mode syntax }

In some embodiments, the delta quantization parameter is always signaled for the palette-mode coded block. Example code for always signaling the delta quantization parameter for a palette mode-coded block is illustrated below:

TABLE 4 palette_coding( x0, y0, cbWidth, cbHeight, startComp, Descrip- numComps ) { tor . . . . . . // Initial palette mode syntax  if( NumPredictedPaletteEntries < palette_max_size )   num_signalled_palette_entries ae(v)  for( cIdx = startComp; cIdx < ( startComp +  numComps); cIdx++ )   for( i = 0; i < num_signalled_palette_entries; i++ )    new_palette_entries[ cIdx ][ i ] ae(v)  if( CurrentPaletteSize[ startComp ] > 0 )   palette_escape_val_present_flag ae(v)  if( MaxPaletteIndex > 0 ) {   num_palette_indices_minus1 ae(v)   adjust = 0   for( i = 0; i <= num_palette_indices_minus1; i++ ) {    if( MaxPaletteIndex − adjust > 0 ) {     palette_idx_idc ae(v)     PaletteIndexIdc[ i ] = palette_idx_idc    }    adjust = 1   }   copy_above_indices_for_final_run_flag ae(v)   palette_transpose_flag ae(v)  }   if( cu_qp_delta_enabled_flag &&   !IsCuQpDeltaCoded ) {    cu_qp_delta_abs ae(v)    if( cu_qp_delta_abs )    cu_qp_delta_sign_flag ae(v)   } . . . . . . // Other palette mode syntax }

In some embodiments, the delta quantization parameters for luma and chroma components are always signaled separately for a palette-mode coded block. Example code for signaling the delta quantization parameter separately for luma and chroma components for a palette mode-coded block is illustrated below:

TABLE 5 palette_coding( x0, y0, cbWidth, cbHeight, startComp, Descrip- numComps ) { tor . . . . . . // Initial palette mode syntax  if( NumPredictedPaletteEntries < palette_max_size )   num_signalled_palette_entries ae(v)  for( cIdx = startComp; cIdx < ( startComp +  numComps); cIdx++ )   for( i = 0; i < num_signalled_palette_entries; i++ )    new_palette_entries[ cIdx ][ i ] ae(v)  if( CurrentPaletteSize[ startComp ] > 0 )   palette_escape_val_present_flag ae(v)  if( MaxPaletteIndex > 0 ) {   num_palette_indices_minus1 ae(v)   adjust = 0   for( i = 0; i <= num_palette_indices_minus1; i++ ) {    if( MaxPaletteIndex − adjust > 0 ) {     palette_idx_idc ae(v)     PaletteIndexIdc[ i ] = palette_idx_idc    }    adjust = 1   }   copy_above_indices_for_final_run_flag ae(v)   palette_transpose_flag ae(v)  }  if( treeType != DUAL_TREE_CHROMA ) {   if( cu_qp_delta_enabled_flag &&   !IsCuQpDeltaCoded ) {    cu_qp_delta_abs ae(v)    if( cu_qp_delta_abs )     cu_qp_delta_sign_flag ae(v)   }  }   if( treeType != DUAL_TREE_LUMA) {    if( cu_chroma_qp_offset_enabled_flag && !IsCuChromaQpOffsetCoded ) {     cu_chroma_qp_offset_flag ae(v)     if( cu_chroma_qp_offset_flag )      cu_chroma_qp_offset_idx ae(v)   }  } . . . . . . // Other palette mode syntax }

In some embodiments, the quantized coefficients corresponding to escape samples in the palette-mode coded block are binary encoded using a fixed-length binarization process based on the quantization parameter value and the bit depth. The binary length of the fixed-length is determined according to either of the following equations:

Binary Length=(Bit Depth−Quantization Parameter Value/6)  (3)

Binary Length=(Bit Depth−(floor(Quantization Parameter−4)/6))  (4)

In some embodiments, the binarization methods are adaptively switched at different coding levels, such as sequence parameter set (SPS), picture parameter set (PPS), slice and/or group of coding blocks. In such case, encoder has the flexibility to dynamically select binarization methods to signal the information in bitstream.

In some embodiments, the fix-length binarization process is used for escape samples when palette mode is lossless. In one example, the escape sample are coded directly based on their binary format value, with each bit coded as a CABAC bypass bin when palette mode is lossless.

In some embodiments, the parameter set associated with the palette-mode coded block comprises: a first syntax element (e.g., palette_max_size) to specify a maximum allowed palette size for the palette-mode coded block; a second syntax element (e.g., palette_max_area) to specify a maximum allowed palette area for the palette-mode coded block; a third syntax element (e.g., palette_max_predictor_size) to specify a maximum allowed palette predictor size of the palette-mode coded block; a fourth syntax element (e.g., delta_palette_max_predictor_size) to specify a difference between the maximum allowed palette predictor size and the max allowed palette size for the palette-mode coded block; a fifth syntax element (e.g., palette_predictor_initializer_present_flag) to initialize a sequence palette predictors for the palette-mode coded block; a sixth syntax element (e.g., num_palette_predictor_initializer_minus1) to specify a number of entries in a palette predictor initializer subtracted by 1 for the palette-mode coded block; a seventh syntax element (e.g., palette_predictor_initializers[component][i]) to specify a value of a component of i-th palette entry that is used to initialize an array of predictor palette entries; an eighth syntax element (e.g., luma_bit_depth_entry_minus8_initializers) to specify a bit depth value of luma component of entries of the palette predictor initializer subtracted by 8; a ninth syntax element (e.g., chroma_bit_depth_entry_minus8_initializers) to specify a bit depth value of chroma components of the entries of the palette predictor initializer subtracted by 8; a tenth syntax element (e.g., luma_bit_depth_entry_minus8) to specify a bit depth value of the luma component of the entries of the palette subtracted by 8; and an eleventh syntax element (e.g., chroma_bit_depth_entry_minus8_initializers) to specify a bit depth value of the chroma components of the entries of the palette subtracted by 8.

In some embodiments, wherein determining the quantization parameter value from the information included in the parameter set associated with the palette-mode coded block comprises: in accordance with a determination that the quantized coefficients for the palette-mode coded block do not correspond to escape samples in the palette-mode coded block (e.g., the coefficients are coded in the palette): setting the quantization parameter value equal to the quantization parameter value (QPcu) included in the parameter set corresponding to the current CU; and in accordance with a determination that the quantized coefficients for the palette-mode coded block correspond to escape samples in the palette-mode coded block: computing the quantized parameter value according to the formula: MIN(((MAX(4, QPcu)−2)/6)*6+4, 61).

In some embodiments, video decoder 30 determines the quantization parameter value from the information included in the parameter set associated with the palette-mode coded block in accordance with a determination that the quantized coefficients for the palette-mode coded block correspond to escape samples in the palette-mode coded block and then limits the quantized parameter value according to the formula: MAX(4, QPcu).

In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over, as one or more instructions or code, a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the implementations described in the present application. A computer program product may include a computer-readable medium.

The terminology used in the description of the implementations herein is for the purpose of describing particular implementations only and is not intended to limit the scope of claims. As used in the description of the implementations and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, elements, and/or components, but do not preclude the presence or addition of one or more other features, elements, components, and/or groups thereof.

It will also be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first electrode could be termed a second electrode, and, similarly, a second electrode could be termed a first electrode, without departing from the scope of the implementations. The first electrode and the second electrode are both electrodes, but they are not the same electrode.

The description of the present application has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications, variations, and alternative implementations will be apparent to those of ordinary skill in the art having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others skilled in the art to understand the invention for various implementations and to best utilize the underlying principles and various implementations with various modifications as are suited to the particular use contemplated. Therefore, it is to be understood that the scope of claims is not to be limited to the specific examples of the implementations disclosed and that modifications and other implementations are intended to be included within the scope of the appended claims. 

1.-20. (canceled)
 21. A method for video decoding, comprising: receiving, from a bitstream, a coding block in a palette mode; determining a quantization parameter from information included in a parameter set associated with the coding block; identifying an escape sample in the coding block; in accordance with a determination that the quantization parameter is greater than a threshold value: obtaining a reconstructed sample based on the escape sample using a predefined formula; and in accordance with a determination that the quantization parameter is equal to the threshold value: setting the reconstructed sample to be a value of the escape sample.
 22. The method of claim 21, wherein: in accordance with a determination that the quantization parameter is greater than the threshold value, the reconstructed sample is obtained through a lossy process; and in accordance with a determination that the quantization parameter is equal to the threshold value, the reconstructed sample is obtained through a lossless process.
 23. The method of claim 21, wherein the predefined formula is associated with a look-up table defined as QP %6 0 1 2 3 4 5 decScale[QP %6] 40 45 51 57 64 72


24. The method of claim 21, wherein the parameter set including the information is a sequence parameter set.
 25. The method of claim 21, wherein the escape sample is associated with additional overhead in the bitstream.
 26. The method of claim 21, wherein the threshold value is equal to
 4. 27. The method of claim 21, wherein determining the quantization parameter comprises: limiting the quantization parameter according to the formula: MAX (4, QPcu), wherein QPcu represents a quantization parameter value corresponding to the coding block.
 28. An electronic apparatus comprising: one or more processing units; a memory coupled to the one or more processing units; and a plurality of programs stored in the memory that, when executed by the one or more processing units, cause the electronic apparatus to perform acts comprising: receiving, from a bitstream, a coding block in a palette mode; determining a quantization parameter from information included in a parameter set associated with the coding block; identifying an escape sample in the coding block; in accordance with a determination that the quantization parameter is greater than a threshold value: obtaining a reconstructed sample based on the escape sample using a predefined formula; and in accordance with a determination that the quantization parameter is equal to the threshold value: setting the reconstructed sample to be a value of the escape sample.
 29. The electronic apparatus of claim 28, wherein: in accordance with a determination that the quantization parameter is greater than the threshold value, the reconstructed sample is obtained through a lossy process; and in accordance with a determination that the quantization parameter is equal to the threshold value, the reconstructed sample is obtained through a lossless process.
 30. The electronic apparatus of claim 28, wherein the predefined formula is associated with a look-up table defined as QP %6 0 1 2 3 4 5 decScale[QP %6] 40 45 51 57 64 72


31. The electronic apparatus of claim 28, wherein the parameter set including the information is a sequence parameter set.
 32. The electronic apparatus of claim 28, wherein the escape sample is associated with additional overhead in the bitstream.
 33. The electronic apparatus of claim 28, wherein the threshold value is equal to
 4. 34. The electronic apparatus of claim 28, wherein determining the quantization parameter comprises: limiting the quantization parameter according to the formula: MAX (4, QPcu), wherein QPcu represents a quantization parameter value corresponding to the coding block.
 35. A non-transitory computer readable storage medium storing a bitstream for execution by an electronic apparatus having one or more processing units, wherein the bitstream, when executed by the one or more processing units, cause the electronic apparatus to perform acts comprising: receiving, from a bitstream, a coding block in a palette mode; determining a quantization parameter from information included in a parameter set associated with the coding block; identifying an escape sample in the coding block; in accordance with a determination that the quantization parameter is greater than a threshold value: obtaining a reconstructed sample based on the escape sample using a predefined formula; and in accordance with a determination that the quantization parameter is equal to the threshold value: setting the reconstructed sample to be a value of the escape sample.
 36. The non-transitory computer readable storage medium of claim 35, wherein: in accordance with a determination that the quantization parameter is greater than the threshold value, the reconstructed sample is obtained through a lossy process; and in accordance with a determination that the quantization parameter is equal to the threshold value, the reconstructed sample is obtained through a lossless process.
 37. The non-transitory computer readable storage medium of claim 35, wherein the predefined formula is associated with a look-up table defined as QP %6 0 1 2 3 4 5 decScale[QP %6] 40 45 51 57 64 72


38. The non-transitory computer readable storage medium of claim 35, wherein the parameter set including the information is a sequence parameter set.
 39. The non-transitory computer readable storage medium of claim 35, wherein the threshold value is equal to
 4. 40. The non-transitory computer readable storage medium of claim 35, wherein determining the quantization parameter comprises: limiting the quantization parameter according to the formula: MAX (4, QPcu), wherein QPcu represents a quantization parameter value corresponding to the coding block. 